Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
121	Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1 Max-Planck-Institut f¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:52 Mathematics Computational complexity theory Graph theory Analysis of algorithms NP-complete problems Probabilistic complexity theory Combinatorics Randomized algorithm Rejection sampling NP Independent set Poisson distribution
122	PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡ Add to Reading List Source URL: users.eecs.northwestern.edu Language: English - Date: 2009-09-15 22:21:32 Computational complexity theory Mathematics Theory of computation NP-complete problems Operations research Approximation algorithms Combinatorial optimization Set cover problem Linear programming relaxation Greedy algorithm Facility location problem Reduction
123	Forecasting Run-Times of Secure Two-Party Computation Axel Schr¨opfer Florian Kerschbaum Add to Reading List Source URL: www.fkerschbaum.org Language: English - Date: 2011-09-10 05:30:51 Cryptography Cryptographic hash functions Information theory Secure multi-party computation Transmission Control Protocol Bandwidth SHA-1 Internet protocol suite Computational complexity theory Network performance
124	The Logarithmic Hypervolume Indicator Tobias Friedrich Karl Bringmann Max-Planck-Institut für Informatik Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:18 Mathematics Mathematical analysis Computational complexity theory Approximation algorithm Multiplicative inverse Logarithm Expected value Multi-objective optimization
125	Capacity of Arbitrary Wireless Networks Olga Goussevskaia Roger Wattenhofer Computer Engineering and Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:24 Computational complexity theory Graph theory Mathematics NP-complete problems Combinatorial optimization NP-hard problems Graph coloring Signal-to-interference-plus-noise ratio NC Open set Independent set Matching
126	. CS711008Z Algorithm Design and Analysis Lecture 5. Basic algorithm design technique: Divide-and-Conquer 1 Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2016-03-29 21:49:55 Mathematics Operations research Applied mathematics Computational complexity theory Algorithms Sorting algorithms Analysis of algorithms Divide and conquer algorithms Selection algorithm Time complexity Merge sort Fast Fourier transform
127	Black-Box Complexity—A Complexity Theory for Evolutionary Computation ´ Presenter: Benjamin Doerr, Ecole Polytechnique de Paris, France; email . Add to Reading List Source URL: www.conference123.org Language: English - Date: 2014-07-16 23:22:02 Evolution Computational complexity theory Theory of computation Metaphysics Analysis of algorithms Probabilistic complexity theory Cybernetics Applied mathematics Complexity Randomized algorithm Algorithm Evolutionary algorithm
128	Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:12 Computational complexity theory Analysis of algorithms Theory of computation Mathematics Edsger W. Dijkstra Algorithm Mathematical logic Theoretical computer science Time complexity Shortest path problem Asymptotically optimal algorithm Randomized algorithm
129	Book, chapter of book, survey articles April 12, L´ aszl´ o Babai and P´eter Frankl. Linear Algebra Methods in Combinatorics, with Applications to Geometry and Computer Science. Univ. of Chicago Dept. Compu Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2014-04-12 05:16:42 Computational complexity theory Module:User:Lesser Cartographies/MR Lszl Babai

UPDATE